A Note on Knowledge-based Programs and Speciications
نویسنده
چکیده
Knowledge-based program are programs with explicit tests for knowledge. They have been used successfully in a number of applications. Sanders has pointed out what seem to be a counterintuitive property of knowledge-based programs. Roughly speaking, they do not satisfy a certain monotonicity property, while standard programs (ones without tests for knowledge) do. It is shown that there are two ways of deening the monotonicity property, which agree for standard programs. Knowledge-based programs satisfy the rst, but do not satisfy the second. It is further argued by example that the fact that they do not satisfy the second is actually a feature, not a problem. Moreover, once we allow the more general class of knowledge-based speciications, standard programs do not satisfy the monotonicity property either.
منابع مشابه
Annals of Mathematics and Arti cial Intelligence 0 ( 2000 ) ? { ? 1 Building a knowledge base : an exampleMichael
The main goal of this paper is to illustrate applications of some recent developments in the theory of logic programming to knowledge representation and reasoning in common sense domains. We are especially interested in better understanding the process of development of such representations together with their speciications. We build on the previous work of Gelfond and Przymusinska in which the...
متن کاملFrom Functional Speciications to Logic Programs
The paper investigates a methodology for representing knowledge in logic programming using functional speciications. The methodology is illustrated by an example formalizing several forms of inheritance reasoning. We also introduce and study a new speciication constructor which corresponds to removal of the closed world assumption from input predicates of functional speciications.
متن کاملFinite State Implementations of Knowledge-Based Programs
Knowledge-based programs have been proposed as an abstract formalism for the design of distributed systems, based on the idea that an agent's actions are a function of its state of knowledge. We identify two natural cases in which nite state implementations of atemporal knowledge-based programs in nite environments may be automatically constructed. The rst concerns an interpretation of knowledg...
متن کاملHigraph-based Predicate and Heterogeneous Speciication
We describe a higraph-based notation for visualizing and writing predicate speciications, and for depicting formal derivations of programs from speciications. We show how to present various system views using the notation, and consider how to deal with abstraction, which is vital in coping with large speciications. We then describe how the notation can be extended to heterogeneous speciications...
متن کاملPrototyping Relational Speciications and Programs with Relview
Based on the representation of relations as Boolean matrices, relational speciications { in our context relation algebraic terms { can be prototyped using the RELVIEW system. Transformational techniques allow to derive eecient programs from these relational speciications which again can be prototyped with RELVIEW. The powerful relational calculus can be used to prove required properties for ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000